A New Adaptive Hungarian Mating Scheme in Genetic Algorithms
نویسندگان
چکیده
منابع مشابه
Adaptive and Assortative Mating Scheme for Evolutionary Multi-Objective Algorithms
We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating scheme that uses similarity in the decision space (genotypic assortative mating) and adapts the mating pressure as the search progresses. We show that this mechanism improves the performance of the simple evolutionary algo...
متن کاملOffspring Selection: A New Self-Adaptive Selection Scheme for Genetic Algorithms
In terms of goal orientedness, selection is the driving force of Genetic Algorithms (GAs). In contrast to crossover and mutation, selection is completely generic, i.e. independent of the actually employed problem and its representation. GA-selection is usually implemented as selection for reproduction (parent selection). In this paper we propose a second selection step after reproduction which ...
متن کاملA Novel Mating Approach for Genetic Algorithms
Genetic algorithms typically use crossover, which relies on mating a set of selected parents. As part of crossover, random mating is often carried out. A novel approach to parent mating is presented in this work. Our novel approach can be applied in combination with a traditional similarity-based criterion to measure distance between individuals or with a fitness-based criterion. We introduce a...
متن کاملAn Adaptive Penalty Scheme for Steady-State Genetic Algorithms
A parameter-less adaptive penalty scheme for steady-state genetic algorithms applied to constrained optimization problems is proposed. For each constraint, a penalty parameter is adaptively computed along the run according to information extracted from the current population such as the existence of feasible individuals and the level of violation of each constraint. Using real coding, rank-base...
متن کاملNew Crossover Scheme for Parallel Distributed Genetic Algorithms
This paper proposes a new crossover method for parallel distributed genetic algorithms (PDGAs). PDGAs with multiple subpopulations provide better solutions than conventional GAs with a single population. The proposed method, including the hybridization crossover and the best combinatorial crossover, is designed to increase the performance of PDGAs. The proposed method, which provides high local...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Dynamics in Nature and Society
سال: 2016
ISSN: 1026-0226,1607-887X
DOI: 10.1155/2016/3512546